Visual Secret Sharing Scheme using Grayscale Images
نویسنده
چکیده
Pixel expansion and the quality of the reconstructed secret image has been a major issue of visual secret sharing (VSS) schemes. A number of probabilistic VSS schemes with minimum pixel expansion have been proposed for black and white (binary) secret images. This paper presents a probabilistic (2, 3)-VSS scheme for gray scale images. Its pixel expansion is larger in size but the quality of the image is perfect when it‟s reconstructed. The construction of the shadow images (transparent shares) is based on the binary OR operation.
منابع مشابه
Ideal Contrast Secret Sharing Scheme through Meaningful Shares with Enveloping Digital Watermarking using Bit Plane based (k,n)-VCS
Visual Cryptography Scheme (VCS) is an encryption method that works on human visual system. It encrypts a secret image into n shares and decryption can be done only by stacking k or more share images without any computation. A new secret sharing scheme with meaningful shares using (k,n)-threshold visual cryptography and digital watermarking for grayscale images based on bit plane encoding is pr...
متن کاملA Technique to Share Multiple Secret Images
Visual Cryptography comes under cryptography domain. It deals with encrypting and decrypting of visual information like pictures, texts, videos etc. Multi Secret Image Sharing (MSIS) scheme is a part of visual cryptography that provides a protected method to transmit more than one secret images over a communication channel. Conventionally, transmission of a single secret image is possible over ...
متن کاملMultiple Secret Sharing Scheme with Gray-Level Mixing
Visual Secret Sharing (VSS) encrypts secret images into n shares and decryption is done through the human vision. But, traditional visual cryptography scheme is restricted to the number of secret images or the performance of recovered image is not good. The proposed scheme shares multiple images using gray level mixing with real size image recovery and has improved contrast of recovered images ...
متن کاملTwo secret sharing schemes based on Boolean operations
Traditional secret sharing schemes involve complex computation.A visual secret sharing (VSS) scheme decodes the secret without computation, but each shadow is m times as big as the original. Probabilistic VSS solved the computation complexity and space complexity problems at once. In this paper we propose a probabilistic (2, n) scheme for binary images and a deterministic (n, n) scheme for gray...
متن کاملThe Optimal n - out - of - n Visual Secret Sharing Scheme for Gray - Scale Images ∗
In this paper, a method is proposed to construct an n-out-of-n visual secret sharing scheme for gray-scale images, for short an (n, n)-VSS-GS scheme, which is optimal in the sense of contrast and pixel expansion, i.e., resolution. It is shown that any (n, n)-VSS-GS scheme can be constructed based on the socalled polynomial representation of basis matrices treated in [15], [16]. Furthermore, it ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1106.6242 شماره
صفحات -
تاریخ انتشار 2011